Extending Polynomiality to a Class of Non-clausal Many-Valued Horn-Like Formulas
نویسندگان
چکیده
In this paper we deal with the SAT problem in many-valued logics wich is of relevant interest in many areas of Artificial Intelligence and Computer Science. Regarding tractability issues, several works have been previously published solving polynomially some clausal manyvalued SAT problems. Thus, our aims is to show that certain nonclausal many-valued SAT problems can be solved in polynomial time too, extending in this way, earlier results from the clausal framework to the more general non-clausal one. Source URL: https://www.iiia.csic.es/en/node/55652 Links [1] https://www.iiia.csic.es/en/staff/edgar-altamirano [2] https://www.iiia.csic.es/en/staff/gonzalo-escalada-imaz [3] https://www.iiia.csic.es/en/bibliography?f[author]=1352 [4] https://www.iiia.csic.es/en/bibliography?f[author]=1359
منابع مشابه
TR - 2003 - 09 The HORN - NNF - SAT problem is linear
Many applications in Computer Science require to represent knowledge and reason with non-clausal form formulas. However, most of the advances obtained in tractable reasoning are applied only to CNF formulas. In this paper, we extend tractability (even linearity) to certain non-clausal formulas which are of high practical interest. For instance, the real applications of the Knowledge Rule-based ...
متن کاملSimpli cation of Many-Valued Logic Formulas Using Anti-Links
We present the theoretical foundations of the many-valued generalization of a technique for simplifying large non-clausal formulas in propositional logic, that is called removal of anti-links. Possible applications of anti-links include computation of prime implicates of large non-clausal formulas as required, for example, in diagnosis. Anti-links do not compute any normal form of a given formu...
متن کاملSimplification of Many-Valued Logic Formulas Using Anti-Links
We present the theoretical foundations of the many-valued generalization of a technique for simplifying large non-clausal formulas in propositional logic, that is called removal of anti-links. Possible applications include computation of prime implicates of large non-clausal formulas as required, for example, in diagnosis. With the anti-link technique, one does not compute any normal form of a ...
متن کاملNon-Clausal Reasoning with Definite Theories
In this paper we propose a general-purpose first-order automated reasoning framework based on the notion of a definite formula and on a non-clausal variant of SLD-resolution. This framework provides a universal Horn clause-like representation of knowledge for classical as well as a range of non-classical first-order logics. It provides a resolution-style method for automated reasoning with theo...
متن کاملNon-clausal Reasoning with Propositional Definite Theories
In this paper we propose a non-clausal representational formalism (of definite formulas) that retains the syntactic flavor and algorithmic advantages of Horn clauses. The notion of a definite formula is generic in the sense that it is available to any logical calculus. We argue that efficient automated reasoning techniques which utilize definite formula representation of knowledge (such as SLD-...
متن کامل